Forcing clique immersions through chromatic number
نویسندگان
چکیده
منابع مشابه
Packing chromatic number versus chromatic and clique number
The packing chromatic number χρ(G) of a graphG is the smallest integer k such that the vertex set of G can be partitioned into sets Vi, i ∈ [k], where each Vi is an i-packing. In this paper, we investigate for a given triple (a, b, c) of positive integers whether there exists a graph G such that ω(G) = a, χ(G) = b, and χρ(G) = c. If so, we say that (a, b, c) is realizable. It is proved that b =...
متن کاملMinimum Clique Number, Chromatic Number, and Ramsey Numbers
Let Q(n, c) denote the minimum clique number over graphs with n vertices and chromatic number c. We investigate the asymptotics of Q(n, c) when n/c is held constant. We show that when n/c is an integer α, Q(n, c) has the same growth order as the inverse function of the Ramsey number R(α+ 1, t) (as a function of t). Furthermore, we show that if certain asymptotic properties of the Ramsey numbers...
متن کاملFractional chromatic number and circular chromatic number for distance graphs with large clique size
Let Z be the set of all integers and M a set of positive integers. The distance graph G(Z,M) generated by M is the graph with vertex set Z and in which i and j are adjacent whenever |i − j| ∈ M . Supported in part by the National Science Foundation under grant DMS 9805945. Supported in part by the National Science Council, R. O. C., under grant NSC892115-M-110-012.
متن کاملClique and chromatic number of circular-perfect graphs
A main result of combinatorial optimization is that clique and chromatic number of a perfect graph are computable in polynomial time (Grötschel, Lovász and Schrijver 1981). Circular-perfect graphs form a well-studied superclass of perfect graphs. We extend the above result for perfect graphs by showing that clique and chromatic number of a circularperfect graph are computable in polynomial time...
متن کاملTowards optimal lower bounds for clique and chromatic number
It was previously known that neither Max Clique nor Min Chromatic Number can be approximated in polynomial time within n1− , for any constant > 0, unless NP = ZPP. In this paper, we extend the reductions used to prove these results and combine the extended reductions with a recent result of Samorodnitsky and Trevisan to show that unless NP ⊆ ZPTIME(2 logn) 3/2)), neither Max Clique nor Min Chro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2016
ISSN: 1571-0653
DOI: 10.1016/j.endm.2016.09.022